Martin’s axiom and saturated models

Fraenkel’s axiom of restriction: Axiom choice, intended models and categoricity

A recent debate has focused on different methodological principles underlying the practice of axiom choice in mathematics (cf. Feferman et al., 2000; Maddy, 1997; Easwaran, 2008). The general aim of these contributions can be described as twofold: first to clarify the spectrum of informal justification strategies retraceable in the history of mathematical axiomatics. Second, to evaluate and to ...

On Bounding Saturated Models

A degree is saturated bounding if it can compute a saturated model for any complete, decidable theory whose types are all computable. All high and PA degrees are saturated bounding (following from results of Jockusch and MacIntyre-Marker.) We show that for every n, no lown c.e. degree is saturated bounding, extending the previous known result that 0 is not saturated bounding, by Millar.

Saturated models in institutions

the date of receipt and acceptance should be inserted later Keywords Saturated models · institutions · institution-independent model theory Abstract Saturated models constitute one of the powerful methods of conventional model theory, with many applications. Here we develop a categorical abstract model theoretic approach to saturated models within the theory of institutions. The most important ...

Saturated models of universal theories

A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a number of important conservation theorems. A constructive, algebraic variation of the method is described, providing yet a third approach, which is finitary but retains the semantic flavor of the model-theoretic version.

Reverse Mathematics of Saturated Models